21 results
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 31 / Issue 1 / January 2022
- Published online by Cambridge University Press:
- 14 June 2021, pp. 109-122
-
- Article
- Export citation
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- Part of
-
- Journal:
- Canadian Journal of Mathematics / Volume 73 / Issue 6 / December 2021
- Published online by Cambridge University Press:
- 10 August 2020, pp. 1648-1666
- Print publication:
- December 2021
-
- Article
- Export citation
A Sharp Dirac–Erdős Type Bound for Large Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 3 / May 2018
- Published online by Cambridge University Press:
- 09 March 2018, pp. 387-397
-
- Article
- Export citation
Adding Edges to Increase the Chromatic Number of a Graph
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 25 / Issue 4 / July 2016
- Published online by Cambridge University Press:
- 31 March 2016, pp. 592-594
-
- Article
- Export citation
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 20 April 2012, pp. 611-622
-
- Article
- Export citation
Large Rainbow Matchings in Edge-Coloured Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 1-2 / March 2012
- Published online by Cambridge University Press:
- 02 February 2012, pp. 255-263
-
- Article
- Export citation
Minors in Graphs with High Chromatic Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 20 / Issue 4 / July 2011
- Published online by Cambridge University Press:
- 13 April 2011, pp. 513-518
-
- Article
- Export citation
Efficient Graph Packing via Game Colouring
-
- Journal:
- Combinatorics, Probability and Computing / Volume 18 / Issue 5 / September 2009
- Published online by Cambridge University Press:
- 01 September 2009, pp. 765-774
-
- Article
- Export citation
5 - Extremal graph packing problems: Ore-type versus Dirac-type
-
-
- Book:
- Surveys in Combinatorics 2009
- Published online:
- 05 May 2013
- Print publication:
- 09 July 2009, pp 113-136
-
- Chapter
- Export citation
Sizes of Induced Subgraphs of Ramsey Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 18 / Issue 4 / July 2009
- Published online by Cambridge University Press:
- 01 July 2009, pp. 459-476
-
- Article
- Export citation
When is an Almost Monochromatic K4 Guaranteed?
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 823-830
-
- Article
- Export citation
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 2 / March 2008
- Published online by Cambridge University Press:
- 01 March 2008, pp. 265-270
-
- Article
- Export citation
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 3 / May 2007
- Published online by Cambridge University Press:
- 01 May 2007, pp. 409-416
-
- Article
- Export citation
Ore-type graph packing problems
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 1 / January 2007
- Published online by Cambridge University Press:
- 20 September 2006, pp. 167-169
-
- Article
- Export citation
On Sufficient Degree Conditions for a Graph to be $k$-linked
-
- Journal:
- Combinatorics, Probability and Computing / Volume 15 / Issue 5 / September 2006
- Published online by Cambridge University Press:
- 31 July 2006, pp. 685-694
-
- Article
- Export citation
On Two Conjectures on Packing of Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 14 / Issue 5-6 / November 2005
- Published online by Cambridge University Press:
- 11 October 2005, pp. 723-736
-
- Article
- Export citation
On Ramsey Numbers of Sparse Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 12 / Issue 5-6 / November 2003
- Published online by Cambridge University Press:
- 03 December 2003, pp. 627-641
-
- Article
- Export citation
Equitable Colourings of d-degenerate Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 12 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 28 January 2003, pp. 53-60
-
- Article
- Export citation
ACYCLIC COLOURINGS OF PLANAR GRAPHS WITH LARGE GIRTH
-
- Journal:
- Journal of the London Mathematical Society / Volume 60 / Issue 2 / October 1999
- Published online by Cambridge University Press:
- 01 October 1999, pp. 344-352
- Print publication:
- October 1999
-
- Article
- Export citation
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 467-472
-
- Article
- Export citation